Verifying Repli ation on a Distributed Shared Data Spa e with Time Stamps
نویسنده
چکیده
Abstra t| We investigate transparent repli ation of omponents on top of the distributed data spa e ar hite ture Spli e. In Spli e ea h omponent has its own lo al data spa e whi h an be kept small using keys, time stamps and sele tive overwriting. Sin e Spli e appli ations are often safetyriti al, we use two omplementary formal tools to ensure orre tness: the CRL tool set is used for a rapid investigation of alternatives by a limited veri ation with state spa e exploration te hniques; next the most promising solutions are veri ed in general by means of the intera tive theorem prover of PVS. With these formal te hniques we showed that repli ation of transformation omponents an be a hieved using sequen e numbers. We also prove the orre tness of a ni er, more transparent solution whi h requires a slight extension of the write primitive of Spli e.
منابع مشابه
Model Checking Techniques for Security Policies in Distributed Collaboration
In this paper, we present the hallenges for model he king se urity poli ies in distributed ollaboration systems. The spe i ation of a ollaboration system is onverted to nite state based veri ation models and are veri ed using a model he ker for orre tness and onsisten y. The main hallenge in nite state based model he king is the state spa e explosion. A related problem for verifying se urity pr...
متن کاملÙøóòóññ Åå Blockinòò×ñ× Óö Ùùðððòò Ë Blockin Blockinððððð Ëëöúú Blockin Blockin× Ò Ïïïï¹¹ööö Ëëëööö Óñôùøøòò Èððøøóöñ×
Cooperatively shared wide-area omputing platforms, su h as PlanetLab, provide a large pool of geographi ally distributed resour es whi h an be utilized for building highly available and s alable servi es. In this thesis, we present me hanisms and models for building autonomi ally s alable and resilient servi es on su h platforms. In su h platforms resour es at a node are allo ated to ompeting u...
متن کاملÎó𺠼 Aeóº ¼ Ìööò×× Blockinøøóò× Óó Áòòóöññøøóò Èöó Blockin
Transa tions of Information Pro essing So iety of Japan 1959 Regular Paper Sear hing for Syn hronization Algorithms using BDDs !!!!!!!!!!(BDD $rMQ$$$?F14|%"%k%4%j%:%‘$NC5:w) Masami Hagiya (GkC+ >;8J)y and Koi hi Takahashi (9b66 9’0l)yy The impa t of veri ation te hnologies would be mu h greater if they ould not only verify existing information systems, but also synthesize or dis over new ones. ...
متن کاملEmbedding Multiway De ision Graphs in HOL
Tarek Mhamdi and So ene Tahar Ele tri al and Computer Engineering Department Con ordia University, Montreal, Canada Email: fmhamdi, taharg e e. on ordia. a Te hni al Report February 2004 Abstra t While model he king su ers from the state spa e explosion problem, theorem proving is quite tedious and impra ti al for verifying omplex designs. In this work, we present a veri ation framework in whi ...
متن کامل